P-adi Constraint Solving
نویسنده
چکیده
منابع مشابه
Numerical method for solving optimal control problem of the linear differential systems with inequality constraints
In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...
متن کاملBlock-ADI Preconditioners for Solving Sparse Nonsymmetric Linear Systems of Equations
There is currently a regain of interest in the Alternating Direction Implicit (ADI) algorithms as preconditioners for iterative methods for solving large sparse linear systems, because of their suitability for parallel computing. However, the classical ADI iteration is not directly applicable to Finite Element (FE) matrices, tends to converge too slowly for 3-D problems, and the selection of ad...
متن کاملHybrid CSP Solving
model K.R. Apt [CP99] for propagation (based on chaotic iterations) Reduction functions of functions Abstraction Constraint CSP Fixed point Partial Ordering Application Hybrid Constraint Solving – p. 55 A Generic Algorithm: propagation for constraint propagation: ordering on size of domains work on a CSP F = { set of propagation functions} X = initial CSP G = F While G 6= ∅ choose g ∈ G G = G− ...
متن کاملA matched Peaceman-Rachford ADI method for solving parabolic interface problems
A new Peaceman–Rachford alternating direction implicit (PR-ADI) method is proposed in this work for solving two-dimensional (2D) parabolic interface problems with discontinuous solutions. The classical ADI schemes are known to be inaccurate for handling interfaces. This motivates the development of a matched Douglas ADI (D-ADI) method in the literature, in which the finite difference is locally...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کامل